On Vizing's edge colouring question
نویسندگان
چکیده
Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal colouring be reached from any given proper through a series of Kempe changes? We answer this question in affirmative for triangle-free graphs.
منابع مشابه
On Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملOn Edge - Colouring
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G) +1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for ind...
متن کاملOn Edge-Colouring Indifference Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suucient condition for 0 (G) = (G) + 1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for ind...
متن کاملOn the Edge-colouring of Split Graphs on the Edge-colouring of Split Graphs
We consider the following question: can split graphs with odd maximum degree be edge-coloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case the graph has a quasi-universal vertex.
متن کاملEdge-colouring and total-colouring chordless graphs
A graph G is chordless if no cycle in G has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it to establish that every chordless graph of maximum degree ∆ ≥ 3 has chromatic index ∆ and total chromatic number ∆+1. The proofs are algorithmic in the sense that we ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2022.10.005